Two General Results on Intuitionistic Bounded Theories
نویسنده
چکیده
We study, within the framework of intuitionistic logic, two well-known general results of (classical logic) bounded arithmetic. Firstly, Parikh’s theorem on the existence of bounding terms for the provably total functions. Secondly, the result which states that adding the scheme of bounded collection to (suitable) bounded theories does not yield new Π2 consequences. Mathematics Subject Classification: 03F30, 03F55, 03C50.
منابع مشابه
INTUITIONISTIC FUZZY BOUNDED LINEAR OPERATORS
The object of this paper is to introduce the notion of intuitionisticfuzzy continuous mappings and intuitionistic fuzzy bounded linear operatorsfrom one intuitionistic fuzzy n-normed linear space to another. Relation betweenintuitionistic fuzzy continuity and intuitionistic fuzzy bounded linearoperators are studied and some interesting results are obtained.
متن کاملPreservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملInterpreting Classical Theories in Constructive Ones
A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of firstand second-order arithmetic, bounded arithmetic, and admissible set theory.
متن کاملComparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
In this note we show that the intuitionistic theory of polynomial induction on Π 1 -formulas does not imply the intuitionistic theory IS 1 2 of polynomial induction on Σ 1 -formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for length induction in place of polynomial induction. We also investigate the relation between various other...
متن کاملThe Polynomial Hierarchy and Intuitionistic Bounded Arithmetic
Intuitionistic theories IS: of Bounded Arithmetic a re introduced and i t is shown tha t the definable functions of IS: a re precisely the 0: functions of the polvnomial hierarchy. This is an extension of earlier work on the classical Bounded Arithmetic and was first conjectured by S. Cook. In contrast t o the classical theories of Bounded b Arithmetic where Ci-definable functions are of intere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 45 شماره
صفحات -
تاریخ انتشار 1999